Linear Size Constant-Composition Codes Meeting the Johnson Bound
نویسندگان
چکیده
منابع مشابه
Constant composition codes derived from linear codes
In this paper, we propose a class of linear codes and obtain their weight distribution. Some of these codes are almost optimal. Moreover, several classes of constant composition codes(CCCs) are constructed as subcodes of linear codes.
متن کاملLinear Size Optimal q-ary Constant-Weight Codes and Constant-Composition Codes
An optimal constant-composition or constant-weight code of weight has linear size if and only if its distance is at least . When , the determination of the exact size of such a constant-composition or constant-weight code is trivial, but the case of has been solved previously only for binary and ternary constant-composition and constant-weight codes, and for some sporadic instances. This paper ...
متن کاملConstant Composition Codes as Subcodes of Linear Codes
Let p be an odd prime and q be a power of p. A linear [n, k, d] code over the finite field Fq is a k-dimensional subspace of F n q with minimum Hamming distance d. Let Ai denote the number of codewords with Hamming weight i in a linear code C of length n. The weight enumerator of C is defined by 1 + A1X + A2X 2 + · · ·+ AnX. The sequence (1, A1, · · · , An) is called the weight distribution of ...
متن کاملLinear codes meeting the Griesmer bound, minihypers, and geometric applications
Coding theory and Galois geometries are two research areas which greatly influence each other. In this talk, we focus on the link between linear codes meeting the Griesmer bound and minihypers in finite projective spaces. Minihypers are particular (multiple) blocking sets. We present characterization results on minihypers, leading to equivalent characterization results on linear codes meeting t...
متن کاملOptimal linear codes, constant-weight codes and constant-composition codes over $\Bbb F_{q}$
Optimal linear codes and constant-weight codes play very important roles in coding theory and have attached a lot of attention. In this paper, we mainly present some optimal linear codes and some optimal constant-weight codes derived from the linear codes. Firstly, we give a construction of linear codes from trace and norm functions. In some cases, its weight distribution is completely determin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2018
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2017.2689026